Computation tree

Results: 129



#Item
41Fast: a Transducer-Based Language for Tree Manipulation Loris D’Antoni University of Pennsylvania

Fast: a Transducer-Based Language for Tree Manipulation Loris D’Antoni University of Pennsylvania

Add to Reading List

Source URL: research.microsoft.com

Language: English - Date: 2014-03-20 17:09:13
42CCCG 2011, Toronto ON, August 10–12, 2011  Sequential Dependency Computation via Geometric Data Structures Gruia Calinescu  ∗

CCCG 2011, Toronto ON, August 10–12, 2011 Sequential Dependency Computation via Geometric Data Structures Gruia Calinescu ∗

Add to Reading List

Source URL: 2011.cccg.ca

Language: English - Date: 2011-08-06 04:11:13
43Fast: a Transducer-Based Language for Tree Manipulation Loris D’Antoni University of Pennsylvania

Fast: a Transducer-Based Language for Tree Manipulation Loris D’Antoni University of Pennsylvania

Add to Reading List

Source URL: research.microsoft.com

Language: English - Date: 2014-03-20 17:09:13
44Automatic construction of parse trees for lexemes ∗ Danny Dub´e Anass Kadiri  Universit´e Laval

Automatic construction of parse trees for lexemes ∗ Danny Dub´e Anass Kadiri Universit´e Laval

Add to Reading List

Source URL: repository.readscheme.org

Language: English - Date: 2012-08-10 19:25:37
45A Universal Innocent Game Model for the B¨ ohm Tree Lambda Theory Andrew D. Ker, Hanno Nickau, and C.-H. Luke Ong Computing Laboratory, Parks Road, Oxford OX1 3QD, UK, {Andrew.Ker, Hanno.Nickau, Luke.Ong}@comlab.ox.ac.u

A Universal Innocent Game Model for the B¨ ohm Tree Lambda Theory Andrew D. Ker, Hanno Nickau, and C.-H. Luke Ong Computing Laboratory, Parks Road, Oxford OX1 3QD, UK, {Andrew.Ker, Hanno.Nickau, Luke.Ong}@comlab.ox.ac.u

Add to Reading List

Source URL: www.cs.ox.ac.uk

Language: English - Date: 2006-07-16 07:23:06
46Tree pattern matching by pushdown automata

Tree pattern matching by pushdown automata

Add to Reading List

Source URL: www.dcs.kcl.ac.uk

Language: English - Date: 2009-02-16 12:13:46
47Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks − Tetsuo Asano (JAIST, Japan) − Jesper Jansson (Ochanomizu University, Japan) − Kunihiko Sadakane (NII, Japan)

Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks − Tetsuo Asano (JAIST, Japan) − Jesper Jansson (Ochanomizu University, Japan) − Kunihiko Sadakane (NII, Japan)

Add to Reading List

Source URL: www.cs.ucr.edu

Language: English - Date: 2010-08-20 17:45:44
48Equivalences for Fair Kripke Structures Adnan Aziz∗ Robert Brayton‡ Felice Balarin†

Equivalences for Fair Kripke Structures Adnan Aziz∗ Robert Brayton‡ Felice Balarin†

Add to Reading List

Source URL: cjtcs.cs.uchicago.edu

Language: English - Date: 2005-09-23 01:02:50
49Quantum Adversary (Upper) Bound

Quantum Adversary (Upper) Bound

Add to Reading List

Source URL: cjtcs.cs.uchicago.edu

Language: English - Date: 2013-04-06 19:44:11
50A composition theorem for decision tree complexity

A composition theorem for decision tree complexity

Add to Reading List

Source URL: cjtcs.cs.uchicago.edu

Language: English - Date: 2014-07-17 09:51:22